Bordered Complex Hadamard Matrices and Strongly Regular Graphs
نویسندگان
چکیده
We consider bordered complex Hadamard matrices whose core is contained in the Bose-Mesner algebra of a strongly regular graph. Examples include matrix conference graph due to J. Wallis, F. Szollősi, and family given by Singh Dubey. In this paper, we prove that there are no other
منابع مشابه
Generation of Strongly Regular Graphs from Normalized Hadamard Matrices
This paper proposes an algorithm which can be used to construct strongly regular graphs from Hadamard matrices.A graph is strongly regular if there are integers and such that every two adjacent vertices have common neighbours and every two non adjacent vertices have common neighbors. Proposed method is mainly based on basic matrix manipulations. If the order of the normalized Hadamard matr ix i...
متن کاملHadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
A graph is 3-e.c. if for every 3-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to every vertex in T and to no vertex in S \ T. Although almost all graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with at least 29 vertices. We construct a new infinite family of 3-e.c. graphs, based on certain...
متن کاملParametrizing complex Hadamard matrices
Abstract. The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N ≥ 4 admits an affine orbit. This settles a recent open problem of Tadej and Życzkowski [11], who asked whether a real Hadamard matrix can be isolated among complex ones. In particular, we apply our construction...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDisconnecting strongly regular graphs
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2021
ISSN: ['1340-9050', '1347-6157']
DOI: https://doi.org/10.4036/iis.2020.r.03